Pursuit-evasion geometry analysis between two missiles and an aircraft

A Method to Solve Missile - Aircraft Pursuit - Evasion Differential Games

This paper shows; that, in some conditions we can obtain the exact solution for a missile and an aircraft differential games which minimizes and maximizes the essential pay-off of the problem: the miss distance, without employing any linearized approximation. The idea of our method is, by starting from the aircraft one-sided optimal control solution against a PNG missile, which maximizes the mi...

Intelligent pursuit & evasion in an unknown environment

This paper introduces a novel and flexible simulation platform for studying pursuit and evasion in unknown 2-D environments of arbitrary obstacles, in an effort to expand the practical application of pursuit-evasion research. The platform provides realistic simulation of the sensing capability of each robotic agent (either a pursuer or an evader). Each agent uses real-time local sensing to coll...

Pursuit- Evasion Games

Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can...

Pursuit/Evasion Voronoi Diagrams∗

In typical 2D Voronoi diagrams, the distance from a site to a point in the plane is unaffected by the existance of other sites. In 2D pursuit/evasion Voronoi diagrams, the distance from an evader to a point is the length of the shortest path to that point that avoids all pursuers. Since pursuers can move, the paths that evaders follow to reach certain points in the plane can be quite complicate...

Pursuit - Evasion Using Beam